Self-stabilizing leader election in optimal space under an arbitrary scheduler
نویسندگان
چکیده
منابع مشابه
Self-Stabilizing Leader Election in Optimal Space
A silent self-stabilizing asynchronous distributed algorithm, SSLE, for the leader election problem, in a connected unoriented network with unique IDs, is given. SSLE uses O(log n) space per process and stabilizes in O(n) rounds, where n is the number of processes in the network.
متن کاملSelf-Stabilizing Mutual Exclusion Under Arbitrary Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate. The mutual exclusion problem is fundamental in distributed computing, since it allows processors competing to access a shared resource to be able to synchronize and get exclusive access to the resource (i.e. execute their critical section). It is...
متن کاملCompact Self-Stabilizing Leader Election for Arbitrary Networks
We present a self-stabilizing leader election algorithm for arbitrary networks, with spacecomplexity Opmaxtlog∆, log lognuq bits per node in n-node networks with maximum degree ∆. This space complexity is sub-logarithmic in n as long as ∆ “ n. The best space-complexity known so far for arbitrary networks was Oplog nq bits per node, and algorithms with sublogarithmic space-complexities were know...
متن کاملDeterministic, Constant Space, Self-Stabilizing Leader Election on Uniform Rings
We consider the problem of electing a leader on a ring of nameless processors by de terministic and self stabilizing protocols A processor can read the state of its neighbors and its own state to determine if it is enabled A central demon scheduler picks an enabled processor to make an atomic move In an atomic move the processor changes to a new state which is a function of its old state and th...
متن کاملSelf-stabilizing Leader Election in Polynomial Steps
In this paper, we propose a silent self-stabilizing leader election algorithm for bidirectional connected identified networks of arbitrary topology. This algorithm is written in the locally shared memory model. It assumes the distributed unfair daemon, the most general scheduling hypothesis of the model. Our algorithm requires no global knowledge on the network (such as an upper bound on the di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2011
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.05.001